A dynamic programming solution to a generalized LCS problem
نویسندگان
چکیده
منابع مشابه
A Dynamic Programming Solution to a Generalized LCS Problem
In this paper, we consider a generalized longest common subsequence problem, the string-excluding constrained LCS problem. For the two input sequences X and Y of lengths n and m, and a constraint string P of length r, the problem is to find a common subsequence Z of X and Y excluding P as a substring and the length of Z is maximized. The problem and its solution were first proposed by Chen and ...
متن کاملAn Efficient Dynamic Programming Algorithm for a New Generalized LCS Problem
In this paper, we consider a generalized longest common subsequence problem, in which a constraining sequence of length s must be included as a substring and the other constraining sequence of length t must be included as a subsequence of two main sequences and the length of the result must be maximal. For the two input sequences X and Y of lengths n and m, and the given two constraining sequen...
متن کاملAn efficient dynamic programming algorithm for the generalized LCS problem with multiple substring inclusive constraints
In this paper, we consider a generalized longest common subsequence problem with multiple substring inclusive constraints. For the two input sequences X and Y of lengths n and m, and a set of d constraints P = {P1, · · · , Pd} of total length r, the problem is to find a common subsequence Z of X and Y including each of constraint string in P as a substring and the length of Z is maximized. A ne...
متن کاملAn Efficient Dynamic Programming Algorithm for the Generalized LCS Problem with Multiple Substring Exclusion Constrains
In this paper, we consider a generalized longest common subsequence problem with multiple substring exclusion constrains. For the two input sequences X and Y of lengths n and m, and a set of d constrains P = {P1, · · · , Pd} of total length r, the problem is to find a common subsequence Z of X and Y excluding each of constrain string in P as a substring and the length of Z is maximized. The pro...
متن کاملAn efficient dynamic programming algorithm for the generalized LCS problem with multiple substring exclusive constraints
Article history: Received 24 March 2013 Received in revised form 4 November 2013 Accepted 24 January 2014 Available online 18 February 2014
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Information Processing Letters
سال: 2013
ISSN: 0020-0190
DOI: 10.1016/j.ipl.2013.07.005